Existence of EF-equivalent non-isomorphic models

نویسندگان

  • Chanoch Havlin
  • Saharon Shelah
چکیده

We prove the existence of pairs of models of the same cardinality λ which are very equivalent according to EF games, but not isomorphic. We continue the paper [4], but we don’t rely on it.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ef Equivalent Not Isomorphic Pair of Models Sh907

We construct non-isomorphic models M,N , e.g. of cardinality א1 such that in the Ehrenfeucht-Fraissé game of any length ζ < ω1 the isomorphism player wins. Research supported by German-Israeli Foundation for Scientific Research and Development (Grant No.I-706-54.6/2001) I would like to thank Alice Leonhardt for the beautiful typing. First Typed 06/Oct/28 Latest Revision 08/Sept/25 Typeset by AM...

متن کامل

A pr 2 00 5 More on regular reduced products

The authors show, by means of a finitary version fin λ,D of the combinatorial principle b ∗ λ of [6], the consistency of the failure, relative to the consistency of supercompact cardinals, of the following: for all regular filters D on a cardinal λ, if Mi and Ni are elementarily equivalent models of a language of size ≤ λ, then the second player has a winning strategy in the Ehrenfeucht-Fräıssé...

متن کامل

The number of L∞κ-equivalent non-isomorphic models for κ weakly compact

For a cardinal κ and a model M of cardinality κ let No(M) denote the number of non-isomorphic models of cardinality κ which are L∞,κequivalent to M . We prove that for κ a weakly compact cardinal, the question of the possible values of No(M) for models M of cardinality κ is equivalent to the question of the possible numbers of equivalence classes of equivalence relations which are Σ1-definable ...

متن کامل

Spanning subgraphs of graphs partitioned into two isomorphic pieces

A graph has the neighbour-closed-co-neighbour, or ncc property, if for each of its vertices x, the subgraph induced by the neighbour set of x is isomorphic to the subgraph induced by the closed non-neighbour set of x. As proved by Bonato, Nowakowski [5], graphs with the ncc property are characterized by the existence of perfect matchings satisfying certain local conditions. In the present artic...

متن کامل

On the Number of L∞ω1-equivalent Non-isomorphic Models

We prove that if ZF is consistent then ZFC + GCH is consistent with the following statement: There is for every k < ω a model of cardinality א1 which is L∞ω1 -equivalent to exactly k non-isomorphic models of cardinality א1. In order to get this result we introduce ladder systems and colourings different from the “standard” counterparts, and prove the following purely combinatorial result: For e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Log. Q.

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2007